Notes on The Connectivity of Cayley Coset Digraphs
نویسنده
چکیده
Hamidoune’s connectivity results [11] for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs. It is shown that if a Cayley coset digraph can be hierarchically decomposed in a certain way, then it is optimally vertex connected. The results are obtained by extending the methods used in [11]. They are used to show that cycle-prefix graphs [5] are optimally vertex connected. This implies that cycle-prefix graphs have good fault tolerance properties.
منابع مشابه
A Class of Double Coset Cayley Digraphs Induced by Quasigroups
In this paper we introduce a new class of double coset Cayley digraphs induced by quasigroups. These graphs can be considered as the generalization of Double Coset Cayley Digraphs induced by loops. Moreover, various graph properties are expressed in terms of algebraic properties. This did not attract much attention in the literature.
متن کاملA Class of Double Coset Cayley Digraphs Induced by Loops
In this paper we introduce a new class of double coset Cayley digraphs induced by loops. These graphs can be considered as the generalization of Double coset Cayley digraphs induced by groups . Moreover, various graph properties are expressed in terms of algebraic properties. This did not attract much attention in the literature. Mathematics Subject Classification: 05C25
متن کاملA class of double coset Cayley digraphs induced by right solvable ward groupoids
In this paper, we introduce a class of double coset cayley digraphs induced by right solvable ward groupoids. These class of graphs can be viewed as a generalization of double coset cayley graphs induced by groups. Further, many graph properties are expressed in terms of algebraic properties.
متن کاملCycles in the cycle prefix digraph
Cycle prefix digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry, large number of nodes for a given degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, and others. In this paper we show that the cycle prefix digraphs, like the Kautz digraphs, contain cycles of all lengths l, with l between two and N , the order of the ...
متن کاملCycles in the cycle pre x digraph
Cycle pre x digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry large number of nodes for a given degree and diameter simple shortest path routing Hamiltonic ity optimal connectivity and others In this paper we show that the cycle pre x digraphs like the Kautz digraphs contain cycles of all lengths l with l between two and N the order of the digraph exce...
متن کامل